Maximum degree in minor-closed classes of graphs
نویسندگان
چکیده
منابع مشابه
Maximum degree in minor-closed classes of graphs
Given a class of graphs G closed under taking minors, we study the maximum degree ∆n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find classes of graphs providing orders of magnitude for ∆n not observed before, such us log n/ log log log n and log n/ log log log log n. © 2016 Elsevier Ltd. All rights re...
متن کاملSome minor-closed classes of signed graphs
We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, projective plane, torus, and Klein bottle. We give the full list of 20 excluded minors for the smallest class and make a conjecture about the largest class.
متن کاملOn the purity of minor-closed classes of graphs
Given a graphH with at least one edge, let gap H (n) denote the maximum difference between the numbers of edges in two n-vertex edge-maximal graphs with no minor H . We show that for exactly four connected graphs H (with at least two vertices), the class of graphs with no minor H is pure, that is, gap H (n) = 0 for all n > 1; and for each connected graph H (with at least two vertices) we have t...
متن کاملOn the growth rate of minor-closed classes of graphs
A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor-closed class G, we let gn be the number of graphs in G which have n vertices. A recent result of Norine et al. [12] shows that for all minor-closed class G, there is a constant c such that gn ≤ c nn!. Our main results show that the growth rate of gn is far from arbit...
متن کاملAsymptotic Properties of Some Minor-Closed Classes of Graphs
Let A be a minor-closed class of labelled graphs, and let Gn be a random graph sampled uniformly from the set of n-vertex graphs of A. When n is large, what is the probability that Gn is connected? How many components does it have? How large is its biggest component? Thanks to the work of McDiarmid and his collaborators, these questions are now solved when all excluded minors are 2-connected. U...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2016.02.001